Almost Sure Bootstrap of the Mean Under Random Normalization
نویسندگان
چکیده
منابع مشابه
A framework of iterative learning control under random data dropouts: Mean square and almost sure convergence
This paper addresses the iterative learning control problem under random data dropout environments. The recent progress on iterative learning control in the presence of data dropouts is first reviewed from 3 aspects, namely, data dropout model, data dropout position, and convergence meaning. A general framework is then proposed for the convergence analysis of all 3 kinds of data dropout models,...
متن کاملThe Almost Sure Convergence for Weighted Sums of Linear Negatively Dependent Random Variables
In this paper, we generalize a theorem of Shao [12] by assuming that is a sequence of linear negatively dependent random variables. Also, we extend some theorems of Chao [6] and Thrum [14]. It is shown by an elementary method that for linear negatively dependent identically random variables with finite -th absolute moment the weighted sums converge to zero as where and is an array of...
متن کاملAlmost Sure Limit Sets of Random Series
I would like to tell you about an easily stated problem which lies at the border of geometry, probability and classical analysis. In the summer of 2005 two undergraduates at McGill University worked in this general area, and were able to make some progress. When posing the project to them I made a certain conjecture, and (as expected) they did not get far enough in their eight week project to b...
متن کاملTHE ALMOST SURE CONVERGENCE OF WEIGHTED SUMS OF NEGATIVELY DEPENDENT RANDOM VARIABLES
In this paper we study the almost universal convergence of weighted sums for sequence {x ,n } of negatively dependent (ND) uniformly bounded random variables, where a, k21 is an may of nonnegative real numbers such that 0(k ) for every ?> 0 and E|x | F | =0 , F = ?(X ,…, X ) for every n>l.
متن کاملProving Positive Almost Sure Termination Under Strategies
In last RTA, we introduced the notion of probabilistic rewrite systems and we gave some conditions entailing termination of those systems within a finite mean number of reduction steps. Termination was considered under arbitrary unrestricted policies. Policies correspond to strategies for non-probabilistic rewrite systems. This is often natural or more useful to restrict policies to a subclass....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1993
ISSN: 0091-1798
DOI: 10.1214/aop/1176989274